Foundational Algorithms for Computational Distributed Robot Swarms
نویسندگان
چکیده
In this paper, we study discrete swarm algorithms, where mobile robots (or “mobots”) move around interacting in an environment to solve computational problems. This work extends recent work on swarm algorithms in the distributed computing, artificial intelligence, and robotics literatures in that we assume that mobots are computational, that is, they have additional memory and hardware so as to enable computations that are somewhat more sophisticated than finite state automata. We describe efficient swarm algorithms for a number of foundational problems, which are essential prerequisites for coordinated movement, data gathering, and data processing computations, including rectangle ranking, prefix sums and products, permutation routing, and sorting. Each of our algorithms is optimal in at least one complexity measure. [Regular submission to SPAA 2008.]
منابع مشابه
Foundational Algorithms for Distributed Robot Swarms
In this paper, we study discrete swarm algorithms, where mobile robots (or “mobots”) move around interacting in an environment to solve computational problems. This work extends recent work on swarm algorithms in the distributed computing, artificial intelligence, and robotics literatures in that we allow for mobots to have additional memory so as to enable computations that are somewhat more s...
متن کاملLong-Lived Distributed Relative Localization of Robot Swarms
This paper studies the problem of having mobile robots in a multi-robot system maintain an estimate of the relative position and relative orientation of near-by robots in the environment. This problem is studied in the context of large swarms of simple robots which are capable of measuring only the distance to near-by robots. We present two distributed localization algorithms with different tra...
متن کاملDistributed Range-Based Relative Localization of Robot Swarms
This paper studies the problem of having mobile robots in a multi-robot system maintain an estimate of the relative position and relative orientation of near-by robots in the environment. This problem is studied in the context of large swarms of simple robots which are capable of measuring only the distance to near-by robots. We compare two distributed localization algorithms with different tra...
متن کاملFeasibility of detecting and localizing radioactive source using image processing and computational geometry algorithms
We consider the problem of finding the localization of radioactive source by using data from a digital camera. In other words, the camera could help us to detect the direction of radioactive rays radiation. Therefore, the outcome could be used to command a robot to move toward the true direction to achieve the source. The process of camera data is performed by using image processing and computa...
متن کاملCzech Technical University in Prague F 3 Faculty of Electrical EngineeringDepartment of Cybernetics Distributed Cohesive Control for Swarms of Micro
This thesis deals with distributed cohesive control of swarms of dimensionless particles and applicability of this approach for using with swarms of micro aerial vehicles. I have implemented a set of algorithms presented in [11] that leads to the cohesive swarm behavior of ground robots in a plane and extended these algorithms to 3D space for control of unmanned aerial vehicles. The behavior of...
متن کامل